Join-semidistributive lattices of relatively convex sets

We give two sufficient conditions for the lattice Co(R^n,X) of relatively convex sets of n-dimensional real space R^n to be join-semidistributive, where X is a finite union of segments. We also prove that every finite lower bounded lattice can be embedded into Co(R^n,X), for a suitable finite subset X of R^n.Comment: 11 pages, first presented on AAA-65 in Potsdam, March 200

Representation of algebraic convex geometries

Convex geometry is a set system generated by the closure operator with the antiexchange axiom. These systems model the concept of convexity in various settings. They are also closely connected to anti-matroids, which are set systems with the property of accessibility. In particular, the latter were used in modelling the states of human learners and found practical applications in designing the automatic tutoring systems. In current work we develop the theoretical foundations of infinite convex geometries in case their closure operator satisfies the finitary property: closure of any subset is a union of closures of its finite subsets. In such case, the convex geometry is called algebraic

Lattices of quasi-equational theories as congruence lattices of semilattices with operators, Part I

We show that for every quasivariety K of structures (where both functions and relations are allowed) there is a semilattice S with operators such that the lattice of quasi-equational theories of K (the dual of the lattice of sub-quasivarieties of K) is isomorphic to Con(S,+,0,F). As a consequence, new restrictions on the natural quasi-interior operator on lattices of quasi-equational theories are found.Comment: Presented on International conference "Order, Algebra and Logics", Vanderbilt University, 12-16 June, 2007 25 pages, 2 figure

On implicational bases of closure systems with unique critical sets

We show that every optimum basis of a finite closure system, in D.Maier's sense, is also right-side optimum, which is a parameter of a minimum CNF representation of a Horn Boolean function. New parameters for the size of the binary part are also established. We introduce a K-basis of a general closure system, which is a refinement of the canonical basis of Duquenne and Guigues, and discuss a polynomial algorithm to obtain it. We study closure systems with the unique criticals and some of its subclasses, where the K-basis is unique. A further refinement in the form of the E-basis is possible for closure systems without D-cycles. There is a polynomial algorithm to recognize the D-relation from a K-basis. Thus, closure systems without D-cycles can be effectively recognized. While E-basis achieves an optimum in one of its parts, the optimization of the others is an NP-complete problem.Comment: Presented on International Symposium of Artificial Intelligence and Mathematics (ISAIM-2012), Ft. Lauderdale, FL, USA Results are included into plenary talk on conference Universal Algebra and Lattice Theory, June 2012, Szeged, Hungary 29 pages and 2 figure

Ordered direct implicational basis of a finite closure system

Closure system on a finite set is a unifying concept in logic programming, relational data bases and knowledge systems. It can also be presented in the terms of finite lattices, and the tools of economic description of a finite lattice have long existed in lattice theory. We present this approach by describing the so-called D-basis and introducing the concept of ordered direct basis of an implicational system. A direct basis of a closure operator, or an implicational system, is a set of implications that allows one to compute the closure of an arbitrary set by a single iteration. This property is preserved by the D-basis at the cost of following a prescribed order in which implications will be attended. In particular, using an ordered direct basis allows to optimize the forward chaining procedure in logic programming that uses the Horn fragment of propositional logic. One can extract the D-basis from any direct unit basis S in time polynomial in the size of S, and it takes only linear time of the cardinality of the D-basis to put it into a proper order. We produce examples of closure systems on a 6-element set, for which the canonical basis of Duquenne and Guigues is not ordered direct.Comment: 25 pages, 10 figures; presented at AMS conference, TACL-2011,ISAIM-2012 and at RUTCOR semina

On the Usability of Probably Approximately Correct Implication Bases

We revisit the notion of probably approximately correct implication bases from the literature and present a first formulation in the language of formal concept analysis, with the goal to investigate whether such bases represent a suitable substitute for exact implication bases in practical use-cases. To this end, we quantitatively examine the behavior of probably approximately correct implication bases on artificial and real-world data sets and compare their precision and recall with respect to their corresponding exact implication bases. Using a small example, we also provide qualitative insight that implications from probably approximately correct bases can still represent meaningful knowledge from a given data set.Comment: 17 pages, 8 figures; typos added, corrected x-label on graph

CD-independent subsets in meet-distributive lattices

A subset $X$ of a finite lattice $L$ is CD-independent if the meet of any two incomparable elements of $X$ equals 0. In 2009, Cz\'edli, Hartmann and Schmidt proved that any two maximal CD-independent subsets of a finite distributive lattice have the same number of elements. In this paper, we prove that if $L$ is a finite meet-distributive lattice, then the size of every CD-independent subset of $L$ is at most the number of atoms of $L$ plus the length of $L$. If, in addition, there is no three-element antichain of meet-irreducible elements, then we give a recursive description of maximal CD-independent subsets. Finally, to give an application of CD-independent subsets, we give a new approach to count islands on a rectangular board.Comment: 14 pages, 4 figure

Algebraic methods of data retrieval

Discovery of (strong) association rules, or implications, between the attributes of a binary table is an important task in data management, and it finds application in artificial intelligence, data mining and the semantic web. The challenge of the task is to deal with the large data sets, when the most known approaches require a time that depends exponentially on the size of the dat

Algebraic methods of data retrieval

Discovery of (strong) association rules, or implications, between the attributes of a binary table is an important task in data management, and it finds application in artificial intelligence, data mining and the semantic web. The challenge of the task is to deal with the large data sets, when the most known approaches require a time that depends exponentially on the size of the dat

LATTICES OF QUASI-EQUATIONAL THEORIES AS CONGRUENCE LATTICES OF SEMILATTICES WITH OPERATORS

Abstract. We show that for every quasivariety K of relational structures there is a semilattice S with operators such that the lattice of quasiequational theories of K (the dual of the lattice of sub-quasivarieties of K) is isomorphic to Con(S,+,0, F). It is known that if S is a join semilattice with 0, then there is a quasivariety Q such that the lattice of theories of Q is isomorphic to Con(S,+,0) (with no operators). We prove that if S is a semilattice having both 0 and 1 with a group G of operators acting on S, then there is a quasivariety W such that the lattice of theories of W is isomorphic to Con(S,+,0, G). 1. Motivation an